On the Probabilistic Zeta Function for Finite Groups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Probabilistic Zeta Function

This paper is a summary of results on the PG(s) function, which is the reciprocal of the probabilistic zeta function for finite groups. This function gives the probability that s randomly chosen elements generate a group G, and information about the structure of the group G is embedded in it.

متن کامل

a finiteness condition on the coefficients of the probabilistic zeta function

we discuss whether finiteness properties of a profinite group $g$ can be deduced from the coefficients of the probabilisticzeta function $p_g(s)$. in particular we prove that if $p_g(s)$ is rational and all but finitely many non abelian composition factors of $g$ are isomorphic to $psl(2,p)$ for some prime $p$, then $g$ contains only finitely many maximal subgroups.

متن کامل

ZETA FUNCTIONS AND COUNTING FINITE p-GROUPS

We announce proofs of a number of theorems concerning finite p-groups and nilpotent groups. These include: (1) the number of p-groups of class c on d generators of order pn satisfies a linear recurrence relation in n; (2) for fixed n the number of p-groups of order pn as one varies p is given by counting points on certain varieties mod p; (3) an asymptotic formula for the number of finite nilpo...

متن کامل

On conjugacy classes of maximal subgroups of finite simple groups, and a related zeta function

We prove that the number of conjugacy classes of maximal subgroups of bounded order in a finite group of Lie type of bounded rank is bounded. For exceptional groups this solves a longstanding open problem. The proof uses, among other tools, some methods from Geometric Invariant Theory. Using this result we provide a sharp bound for the total number of conjugacy classes of maximal subgroups of L...

متن کامل

On the Zeta Function of a Periodic-Finite-Type Shift

Periodic-finite-type shifts (PFT’s) are sofic shifts which forbid the appearance of finitely many pre-specified words in a periodic manner. The class of PFT’s strictly includes the class of shifts of finite type (SFT’s). The zeta function of a PFT is a generating function for the number of periodic sequences in the shift. For a general sofic shift, there exists a formula, attributed to Manning ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1998

ISSN: 0021-8693

DOI: 10.1006/jabr.1998.7560